基于Hadoop的气象数据分布式存储技术研究

针对目前气象数据存储所面临的海量扩张、高并发读写、结构化和非结构化数据并存以及长时间序列和大数据集检索效率低下等问题,提出了以Hadoop开源框架为基础的气象数据分布式存储方案。通过对气象数据自身属性和特点进行分析,得出了气象数据在经过充分优化的基础上,在分布式存储框架中具有很强的适应性和规模化应用的潜力;并在HBase数据库中的Row Key设计和小文件合并策略方面做了创新。最后针对气象数据中广泛存在的结构化和非结构化这两种主要数据类型,以自动气象站数据和雷达产品数据为具体实例,给出了详细的设计思路和实现方法。     

Revisiting the Parallel Strategy for DOACROSS Loops

Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front...     

WSN低功耗低时延路径式协同计算方法

针对云计算应用于无线传感器网络(Wireless Sensor Network,WSN)时延敏感型业务时存在的高传输时延问题,提出了一种WSN低功耗低时延路径式协同计算方法。该方法基于一种云雾网络架构开展研究,该架构利用汇聚节点组成雾计算层;在数据传输过程中基于雾计算层的计算能力分步骤完成任务计算,降低任务处理时延;由于汇聚节点计算能力较弱,时延降低将导致能耗增加,WSN工作寿命减短,为此提出能耗约束下的任务映射策略,并利用离散二进制粒子群优化(Binary Particle Swarm Optimization,BPSO)算法解决能耗约束下的时延优化问题。仿真结果表明,在相同的能耗约束下,对比其他算法,基于BPSO算法得出的映射方案能有效降低业务处理时延,满足时延敏感型业务的需求。     

Translation speed measurements of hydrogen,helium, and argon field-reversed configurations in the central cell of a KMAX mirror device

A series of experimental results of field-reversed configurations (FRCs) on a KMAX (Keda Mirror with AXisymmetricity) tandem mirror machine are reported. Single-side FRC translation processes with three different gas species were measured by avalanche photodiodes. Consistent with the theoretical prediction, the measured FRC speeds were inversely proportional to the square root of the ion mass. However, the speeds of the hydrogen FRC increased even in a uniform magnetic field region while the speeds of the helium and argon FRCs decreased. Possible mechanisms are discussed. The speed of the second pass due to the reflection of the mirror fields was found to be ∼1/3 of the first pass speed. The internal magnetic fields were measured for a colliding-merging argon FRC, and the results show that, even for very slowmoving FRCs, merging can occur.     

基于压缩感知的移动群智感知任务分发机制

针对移动群智感知任务中区域全覆盖感知成本过高问题，提出基于压缩感知的移动群智感知任务分发（CS-TD）机制。首先提出了感知任务整体成本模型，该模型综合考虑了参与感知任务的节点个数、节点的感知次数与数据上传次数；然后基于成本模型，分析感知节点的日常移动轨迹，结合压缩感知数据采集技术，提出了一种基于感知节点轨迹的压缩感知采样方法；其次通过区域全覆盖最少节点（RCLN）算法，选出最佳节点集合，对节点进行任务分配，利用压缩感知技术恢复节点数据；最后在多次感知任务的迭代中对感知节点的可信程度进行评定，保证任务方案的最优性。对CS-TD分发模型进行多次实验验证，与已有的CrowdTasker算法相比，CS-TD算法平均成本降低了30%以上。CS-TD模型能有效降低感知节点的消耗，能在全覆盖感知任务中降低整体感知成本。     

结合位图切割和区域合并的彩色图像分割

就经典分水岭图像分割算法中存在的过分割问题，提出一种结合位图切割和区域合并的彩色图像分割算法。对原始彩色图像通过空域梯度算子求其梯度图像，并利用位图切割重建梯度图像；对新梯度图像进行分水岭预分割；对预分割图像基于异质性最小原则进行区域合并，并获得最终分割结果。相比于现有的同类方法，该算法引入位图切割，抑制噪声对分割结果的影响，在边缘模糊处分割准确，得到符合人类视觉的较小分割区域数目，同时在运行效率上提高。     

Why stop after 20 minutes? Breaks and target prevalence in a 60-minute X-ray baggage screening task

Current EU regulation restricts continuously reviewing X-ray images of passenger baggage to 20-min duration as a precautionary measure to prevent performance decrements in airport security officers (screeners). However, this 20-min limit is not based on clear empirical evidence on how well screeners can sustain their performance over time. Our study tested screeners in a 60-min simulated X-ray cabin baggage screening task. One group took 10-min breaks after 20 min of screening; the other group worked without breaks. We found no decrease in performance over 60 min in either group. Breaks did not affect performance, but they did reduce the amount of subjective distress. By varying target prevalence, we found that d_a with a slope of about 0.6 is a more valid measure of detection performance than d'. Target prevalence caused a criterion shift. Our results provide a basis for conducting field studies of prolonged screening durations, and open the discussion on whether more flexible break policies and work schedules should be considered.     

Automated coronal hole segmentation from Solar EUV Images using the watershed transform

Region of interest segmentation in solar images is the subject of frequent research in solar physics. This study outlines watershed by immersion segmentation to identify coronal hole areas in solar images acquired using the Extreme UV Imaging Telescope (EIT). Solutions presented here produce highly accurate segmentation results of coronal holes of irregular shape, and what is more, they do so for images representing varied solar activity, recorded in different years and months. In addition, the solutions presented here make all the methods used operate very quickly. These methods include: the preprocessing step before the watershed segmentation, the watershed segmentation itself, and also the postprocessing of solar images after the watershed segmentation. The mean duration of the entire segmentation process of solar images amounts to 342 ms for a single coronal hole, without the parallel implementation of the methods used. The experiments were carried out on a computer with an Intel Core i7 CPU @ 2 GHz and 4 GB RAM. After the seed point is identified inside the coronal hole, the segmentation runs automatically.     

面向可解释性的物体拓扑结构骨架表征方法

目的 模式识别中，通常使用大量标注数据和有效的机器学习算法训练分类器应对不确定性问题。然而，这一过程缺乏知识表征和可解释性。认知心理学和实验心理学的研究表明，人类往往不使用代价如此巨大的机制，而是使用表征、归纳、推理、解释和约束传播等与符号主义人工智能方法类似的手段来应对物体识别中的不确定性并提供可解释性。因此本文旨在从传统的符号计算出发，利用骨架拓扑结构表征提供一种可解释性的思路。方法 以骨架树为基本手段来形成物体拓扑结构特征和几何特征的形式化表征，并基于泛化框架对少量同类表征进行知识抽取来形成关于物体类别的知识概括显式化表征。结果 在形成物体类别的概括表征实验中，通过路径重建直观展示了同类属物体上得到的最一般表征的几何物理意义。在可解释性验证实验中，通过跨数据的拓扑应用展示了新测试样本相对于概括表征的特定差异，表明该表征具有良好的可解释性。最后在形状补全的不确定性推理实验中，不仅可以得到识别结论，而且清晰展示了识别背后做出的判断依据，进一步验证了该表征的可解释性。结论 实验表明一般化的形式表征能够应对尺寸、颜色和形状等不确定性问题，本文方法避免了基于纹理特征所带来的不确定性，适用于任意基于基元的表征方式，具有更好的鲁棒性、普适性和可解释性，计算代价更小。